On Lower Bound of the Number of Channels for Deadlock-free Whormhole Routing
نویسندگان
چکیده
In [1], Libeskind-Hadas recently provided a tight lower bound on the number of channels required by a broad class of deadlock-free wormhole routing algorithm. Given an interconnection network represented by a digraph G = (N;C), where each vertex in N represents a node and each directed link in C represents a unidirectional channel, Libeskind-Hadas showed that jCj 2jN j 2 is the tight lowered on the number of Channels required for Deadlock-Free Whormhole Routing. In this short note, we show a simpler proof of this tight lower bound.
منابع مشابه
A Note on 'A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing'
ÐIn [1], Libeskind-Hadas provided a tight lower bound on the number of channels required by a broad class of deadlock-free wormhole routing algorithms. In this short note, we show a simpler proof of the tight lower bound. Index TermsÐDeadlock-free routing, interconnection networks, strongly
متن کاملA Tight Bound on the Number of Channel Faults in Wormhole-Routed Multicomputers
Several fault-tolerant deadlock-free routing algorithms have been proposed recently for worm-hole-routed multicomputers, with the number of faults tolerated by these algorithms varying widely. An important problem, therefore, is that of determining a tight lower bound on the number of channels that must be non-faulty in order for messages to be routed without deadlock among the set of remaining...
متن کاملLayered Shortest Path (LASH) Routing in Irregular System Area Networks
In recent years we have seen a growing interest in irregular network topologies for cluster interconnects. One problem related to such topologies is that the combination of shortest path and deadlock free routing is difficult. As a result of this the existing solutions for routing in irregular networks either guarantee shortest paths relative to some constraint (like up*/down*), or have to reso...
متن کاملCAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip
By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...
متن کاملDeadlock-free wormhole routing algorithms for star graph topology
For constructing massively parallel multicomputers with over 5000 processing nodes, the Star Graph topology is known to be better than the hypercube in terms of the average routing distance, the number of links per node, and the fault diameter. The authors present two deadlock-free algorithms for routing in Star Graph, assuming the Wormhole routing model. Both the algorithms use the concept of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999